Deductive synthesis of sorting programs

The Deductive Synthesis of Imperative LISP Programs

A framework is described for the automatic synthesis of imperative programs, which may alter data structures and produce destructive side effects as part of their intended behavior. A program meeting a given specification is extracted from the proof of a theorem in a variant of situational logic, in which the states of a computation are explicit objects. As an example, an in-place reverse progr...

Deductive and Inductive Synthesis of Equational Programs |Draft|

An equational approach to the synthesis of functional and logic program is taken. Typically, the synthesis task involves nding equations which make the given speci cation an inductive theorem. To synthesize such programs, induction is necessary. We formulate e cient procedures for inductive proof as well as program synthesis using the framework of ordered rewriting. We also propose heuristics f...

On Specification Frameworks and Deductive Synthesis of Logic Programs

The Halting Problem for Deductive Synthesis of Logic Programs

Deductive synthesis methods derive programs in an incremental manner, and therefore pose a halting problem { when can synthesis stop with a correct program? We give a characterisation of this problem and state a halting principle as a solution. Another characteristic of deductive synthesis is that it may derive several correct programs, giving rise to another question { which correct programs a...

A Formal Approach to Deductive Synthesis of Constraint Logic Programs

Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their speciications, and is therefore of crucial importance to formal development of veriiably correct software. Declarative paradigms such as logic programming are particularly suitable for program synthesis, and we have formulated a formal approach to synthesising standard logic programs. Our approach...